Extracting Dendritic Trees From 3-D Image Stack
نویسنده
چکیده
Research on three-dimensional(3-D) digital images has drawn increasing interest in recent years as collection has become easier. The sources of 3-D images include stacks of two-dimensional (2-D)images obtained, for example, by computerized micrography and similar tecnologies, or sequences of 2-D time-varying images. Some basic 2-D image processing operations may be easily extended to 3-D stacks but in other cases the additional complexity is non trivial.
منابع مشابه
A stack-based chaotic algorithm for encryption of colored images
In this paper, a new method is presented for encryption of colored images. This method is based on using stack data structure and chaos which make the image encryption algorithm more efficient and robust. In the proposed algorithm, a series of data whose range is between 0 and 3 is generated using chaotic logistic system. Then, the original image is divided into four subimages, and these four i...
متن کاملDendritic tree extraction from noisy maximum intensity projection images in C. elegans
BACKGROUND Maximum Intensity Projections (MIP) of neuronal dendritic trees obtained from confocal microscopy are frequently used to study the relationship between tree morphology and mechanosensory function in the model organism C. elegans. Extracting dendritic trees from noisy images remains however a strenuous process that has traditionally relied on manual approaches. Here, we focus on autom...
متن کاملDeep Structure, Singularities, and Computer Vision DSSCV
The deep structure of an image is investigated, and a Multi-Scale Singularity Tree (MSST) is constructed based on the pair-wise annihilations of critical points. This report contains two main contributions. Firstly, we describe a fast, simple, and robust method of extracting feature lines from data sets of up to four dimensions, which we apply in order to extract critical paths from scale-space...
متن کاملDeep Structure, Singularities, and Computer Vision DSSCV
The deep structure of an image is investigated, and a Multi-Scale Singularity Tree (MSST) is constructed based on the pair-wise annihilations of critical points. This report contains two main contributions. Firstly, we describe a fast, simple, and robust method of extracting feature lines from data sets of up to four dimensions, which we apply in order to extract critical paths from scale-space...
متن کاملSuperimposed Code-Based Indexing Method for Extracting MCTs from XML Documents
With the exponential increase in the amount of XML data on the Internet, information retrieval techniques on tree-structured XML documents such as keyword search become important. The search results for this retrieval technique are often represented by minimum connecting trees (MCTs) rooted at the lowest common ancestors (LCAs) of the nodes containing all the search keywords. Recently, effectiv...
متن کامل